/*
package com.ken.algorithms.tree;

*/
/**
 * <ul>
 * <li>Title: BinaryTree</li>
 * <li>Description: TODO </li>
 * </ul>
 *
 * @author swc
 * @date 2021-09-10 15:43
 *//*

public class BinaryTree {

    private int val;

    private BinaryTree left;

    private BinaryTree right;

    public BinaryTree (int val) {
        this.val = val;
        this.left = null;
        this.right = null;
    }

    public int getVal() {
        return val;
    }

    public void setVal(int val) {
        this.val = val;
    }

    public BinaryTree getLeft() {
        return left;
    }

    public void setLeft(BinaryTree left) {
        this.left = left;
    }

    public BinaryTree getRight() {
        return right;
    }

    public void setRight(BinaryTree right) {
        this.right = right;
    }
}
*/
